Huge Unimodular $n$-Fold Programs
نویسندگان
چکیده
منابع مشابه
Huge Unimodular N-Fold Programs
Optimization over l ×m× n integer 3-way tables with given line-sums is NP-hard already for fixed l = 3, but is polynomial time solvable with both l,m fixed. In the huge version of the problem, the variable dimension n is encoded in binary, with t layer types. It was recently shown that the huge problem can be solved in polynomial time for fixed t, and the complexity of the problem for variable ...
متن کاملTotally unimodular stochastic programs
We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it i...
متن کاملn-fold Commutative Hyper K-ideals
In this paper, we aresupposed to introduce the definitions of n-fold commutative, andimplicative hyper K-ideals. These definitions are thegeneralizations of the definitions of commutative, andimplicative hyper K-ideals, respectively, which have been definedin [12]. Then we obtain some related results. In particular wedetermine the relationships between n-fold implicative hyperK-ideal and n-fol...
متن کاملTotally unimodular multistage stochastic programs
We consider totally unimodular multistage stochastic programs, that is, multistage stochastic programs whose extensive-form constraint matrices are totally unimodular. We establish several sufficient conditions and identify examples that have arisen in the literature.
متن کاملHuge tables are fixed parameter tractable via unimodular integer Caratheodory
The three-way table problem is to decide if there exists an l × m × n table satisfying given line sums, and find a table if yes. Recently, it was shown to be fixed-parameter tractable with parameters l, m. Here we extend this and show that the huge version of the problem, where the variable side n is encoded in binary, is also fixed-parameter tractable with parameters l, m. We also conclude tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/151004227